Improving a constructive heuristic for the general routing problem
نویسندگان
چکیده
The general routing problem (GRP) is a fundamental ???? ???? -hard vehicle problem, first defined by Orloff in 1974. It contains as special cases the Chinese postman rural graphical TSP, and Steiner TSP. We examine detail known constructive heuristic for GRP, due to Christofides others. show how speed it up, both theory practice, while obtaining solutions that are at least good. Computational results that, large instances, our implementation faster than original several orders of magnitude.
منابع مشابه
A Constructive Heuristic for a Multi-Product Inventory Routing Problem
Inventory management and transportation issues are very important problems in distribution companies. Simultaneous l optimization of these problems realizes significant savings for all partners of the supply chain. One of the problems that should be addressed in the scope of simultaneous sl optimization is the inventory routing problem (IRP). IRP deals with how to manage the supply goods from o...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملA Two-Phase Hybrid Heuristic Method for a Multi-Depot Inventory-Routing Problem
In this study, a two phase hybrid heuristic approach was proposed to solve the multi-depot multi-vehicle inventory routing problem (MDMVIRP). Inventory routing problem (IRP) is one of the major issues in the supply chain networks that arise in the context of vendor managed systems (VMI) The MDMVIRP combines inventory management and routing decision. We are given on input a fleet of homogeneous ...
متن کاملA Randomized Population Constructive Heuristic for the Team Orienteering Problem
Email: [email protected] Abstract: The NP-hard (complete) team orienteering problem is a particular vehicle routing problem with the aim of maximizing the profits gained from visiting control points without exceeding a travel cost limit. The team orienteering problem has a number of applications in several fields such as athlete recruiting, technician routing and tourist trip. Therefore, so...
متن کاملA Constructive Heuristic for the Integrated Inventory-distribution Problem
We study the integrated inventory distribution problem which is concerned with multiperiod inventory holding, backlogging, and vehicle routing decisions for a set of customers who receive units of a single item from a depot with infinite supply. We consider an environment in which the demand at each customer is deterministic and relatively small compared to the vehicle capacity, and the custome...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2022
ISSN: ['0028-3045', '1097-0037']
DOI: https://doi.org/10.1002/net.22119